Concurrent disjoint set union
نویسندگان
چکیده
منابع مشابه
Finding dominators via disjoint set union
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-lineartime algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in n...
متن کاملDisjoint Set Union with Randomized Linking
A classic result in the analysis of data structures is that path compression with linking by rank solves the disjoint set union problem in almost-constant amortized time per operation. Recent experiments suggest that in practice, a näıve linking method works just as well if not better than linking by rank, in spite of being theoretically inferior. How can this be? We prove that randomized linki...
متن کاملMarker-based image segmentation relying on disjoint set union
Marker-based image segmentation has been widely used in image analysis and understanding. The well-known Meyer’s marker-based watershed algorithm by immersion is realized using the hierarchical circular queues. A new marker-based segmentation algorithm relying on disjoint set union is proposed in this paper. It consists of three steps, namely: pixel sorting, set union, and pixel resolving. The ...
متن کاملDisjoint-union partial algebras
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjointunion partial algebra of sets but prove that ...
متن کاملExperiments on Union-Find Algorithms for the Disjoint-Set Data Structure
The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structure are often referred to as Union-Find algorithms. They are used in numerous practical applications and are also available in several software libraries. This paper presents an extensive experimental study comparing the time req...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2021
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-020-00388-x